Universal Channel Coding for General Output Alphabet

Universal channel coding for general output alphabet

We propose a universal channel coding when each output distribution forms an exponential family even in a continuous output system. We propose two types of universal codes; One has the exponentially decreasing error with explicit a lower bound for the error exponent. The other attains the ǫ-capacity up to the second order. Our encoder is the same as the previous paper [CMP 289, 1087]. For our d...

Universal Source Coding of Finite Alphabet Sources

The application of Shannon’s rate distortion theory to real data compression practice has been limited by a lack of effective distortion measures for most real users and incomplete statistical knowledge of real sources. Universal source coding techniques attempt to overcome the latter limitation by developing codes that are effective (in the sense of approaching the theoretical rate distortion ...

Universal Prediction for General Loss and Alphabet 3

Optimal Coding for the Erasure Channel with Arbitrary Alphabet Size

An erasure channel with a fixed alphabet size q, where q ≫ 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes achieve the minimum probability of error (assuming maximum likelihood decoding). Assuming a memoryless erasure channel, the error exponent of MDS codes are compared with that of random codes and linear random codes...

Universal coding for classical-quantum channel

We construct a universal code for stationary and memoryless classicalquantum channel as a quantum version of the universal coding by Csiszár and Körner. Our code is constructed by the combination of irreducible representation, the decoder introduced through quantum information spectrum, and the packing lemma.